Detecting geometric infeasibility

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting Geometric Infeasibility

We consider the problem of deciding whether an assembly of polyhedra can partitioned by an arbitrary sequence of translations. Di erent subassemblies may be moved at di erent stages. It is shown that certain D dimensional arrangements of hyperplanes can be searched in the following way: only a single connected component is traversed during the search, and the arrangement is searched as an arran...

متن کامل

Detecting Infeasibility and Generating Cuts for MIP using CP

We study a hybrid MIP/CP solution approach in which CP is used for detecting infeasibilities and generating cuts within a branch-and-cut algorithm for MIP. Our framework applies to MIP problems augmented by monotone constraints that can be handled by CP. We illustrate our approach on a generic multiple machine scheduling problem, and compare it to other hybrid MIP/CP algorithms.

متن کامل

Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization

We study interior-point methods for optimization problems in the case of infeasibility or unboundedness. While many such methods are designed to search for optimal solutions even when they do not exist, we show that they can be viewed as implicitly searching for well-defined optimal solutions to related problems whose optimal solutions give certificates of infeasibility for the original problem...

متن کامل

New stopping criteria for detecting infeasibility in conic optimization

Detecting infeasibility in conic optimization and providing certificates for infeasibility pose a bigger challenge than in the linear case due to the lack of strong duality. In this paper we generalize the approximate Farkas lemma of Todd and Ye [12] from the linear to the general conic setting, and use it to propose stopping criteria for interior point algorithms using self-dual embedding. The...

متن کامل

Logical omniscience as infeasibility

Article history: Available online 20 August 2013 MSC: 03B45 03B60 03F07 68Q17

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1998

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(98)00076-9